Structure of the maximal -local geometry point-line collinearity graph
نویسندگان
چکیده
منابع مشابه
Line graphs associated to the maximal graph
Let $R$ be a commutative ring with identity. Let $G(R)$ denote the maximal graph associated to $R$, i.e., $G(R)$ is a graph with vertices as the elements of $R$, where two distinct vertices $a$ and $b$ are adjacent if and only if there is a maximal ideal of $R$ containing both. Let $Gamma(R)$ denote the restriction of $G(R)$ to non-unit elements of $R$. In this paper we study the various graphi...
متن کاملline graphs associated to the maximal graph
let $r$ be a commutative ring with identity. let $g(r)$ denote the maximal graph associated to $r$, i.e., $g(r)$ is a graph with vertices as the elements of $r$, where two distinct vertices $a$ and $b$ are adjacent if and only if there is a maximal ideal of $r$ containing both. let $gamma(r)$ denote the restriction of $g(r)$ to non-unit elements of $r$. in this paper we study the various graphi...
متن کاملساختار کلاسهایی از حلقه های z- موضعی و c- موضعی the structure of some classes of z-local and c-local rings
فرض کنیمr یک حلقه تعویض پذیر ویکدار موضعی باشدو(j(r رایکال جیکوبسن r و(z(r مجموعه مقسوم علیه های صفر حلقه r باشد.گوییم r یک حلقه z- موضعی است هرگاه j(r)^2=. .همچنین برای یک حلقه تعویض پذیر r فرض کنیم c یک عنصر ناصفر از (z( r باشد با این خاصیت که cz( r)=0 گوییم حلقه موضعی r یک حلقه c - موضعی است هرگاه و{0 و z(r)^2={cو z(r)^3=0, نیز xz( r)=0 نتیجه دهد که x عضو {c,0 } است. در این پایان نامه ساخ...
MAXIMAL INDEPENDENT SETS FOR THE PIXEL EXPANSION OF GRAPH ACCESS STRUCTURE
Given a graph G, a visual cryptography scheme based on the graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper we apply maximal independent sets of the grap...
متن کاملMaximal Independent Sets for the Pixel Expansion of Graph Access Structure
Abstract : A visual cryptography scheme based on a given graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper a maximal independent sets of the graph G was ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: LMS Journal of Computation and Mathematics
سال: 2016
ISSN: 1461-1570
DOI: 10.1112/s1461157016000036